János Pintz

János Pintz (December 20, 1950, Budapest)[1] is a Hungarian mathematician working in analytic number theory. He is a fellow of the Rényi Mathematical Institute and is also a member of the Hungarian Academy of Sciences.

Contents

Mathematical results

\liminf_{n\to\infty}\frac{p_{n%2B1}-p_n}{\log p_n}=0

where p_n\ denotes the nth prime number. In other words, for every c > 0, there exist infinitely many pairs of consecutive primes pn and pn+1 that are closer to each other than the average distance between consecutive primes by a factor of c, i.e., pn+1 − pn < c log pn.

This result was originally reported in 2003 by Dan Goldston and Cem Yıldırım but was later retracted.[3][4] Then Janos Pintz joined the team and completed the proof in 2005. Later they improved this to showing that pn+1-pn<clog n(log log n)2 occurs infinitely often.

Further, if one assumes the Elliott-Halberstam conjecture, then one can also show that primes within 16 of each other occur infinitely often, which is nearly the twin prime conjecture.

See also

References

  1. ^ Peter Hermann, Antal Pasztor: Magyar és nemzetközi ki kicsoda, 1994
  2. ^ http://arxiv.org/abs/math/0508185
  3. ^ http://aimath.org/primegaps/
  4. ^ http://www.aimath.org/primegaps/residueerror/
  5. ^ D. Goldston, S. W. Graham, J. Pintz, C. Yıldırım: Small gaps between products of two primes, Proc. Lond. Math. Soc., 98(2007) 741–774.

External links